Chords of longest circuits of graphs embedded in torus and Klein bottle

نویسندگان

  • Xuechao Li
  • Cun-Quan Zhang
چکیده

Thomassen conjectured that every longest circuit of a 3connected graph has a chord. It is proved in this paper that every longest circuit of a 4-connected graph embedded in a torus or Klein bottle has a chord. 2003 Wiley Periodicals, Inc. J Graph Theory 43: 1–23, 2003

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the restricted matching extension of graphs on the torus and the Klein bottle

Aldred and Plummer proved that every 6-connected even graph minimally embedded on the torus or the Klein bottle is E(1, n)(n ≤ 3) and E(0, n)(n ≤ 5) [R.E.L. Aldred, M.D. Plummer, Restricted matching in graphs of small genus, Discrete Math. 308 (2008) 5907–5921]. In this paper, we can remove the upper bounds on n by showing that every even 6-regular graph G embedded on the torus or the Klein bot...

متن کامل

Four-regular graphs that quadrangulate both the torus and the Klein bottle

In this paper, we characterize 4-regular graphs which can quadrangulate both the torus and the Klein bottle.

متن کامل

Chords of longest circuits in locally planar graphs

It was conjectured by Thomassen ([B. Alspach, C. Godsil, Cycle in graphs, Ann. Discrete Math. 27 (1985)], p. 466) that every longest circuit of a 3-connected graph must have a chord. This conjecture is verified for locally 4-connected planar graphs, that is, let N be the set of natural numbers; then there is a function h : N → N such that, for every 4-connected graph G embedded in a surface S w...

متن کامل

Chords of longest circuits in 3-connected graphs

Thomassen conjectured that every longest circuit of a 3-connected graph has a chord. The conjecture is veri2ed in this paper for projective planar graphs with minimum degree at least 4. c © 2002 Elsevier Science B.V. All rights reserved.

متن کامل

Small snarks and 6-chromatic triangulations on the Klein bottle

It is known that for every nonorientable surface there are infinitely many (large) snarks that can be polyhedrally embedded on that surface. We take a dual approach to the embedding of snarks on the Klein bottle, and investigate edge-colorings of 6-chromatic triangulations of the Klein bottle. In the process, we discover the smallest snarks that can be polyhedrally embedded on the Klein bottle....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Journal of Graph Theory

دوره 43  شماره 

صفحات  -

تاریخ انتشار 2003